Equality in Linear Logic
نویسندگان
چکیده
1 Quantales In this section we introduce the basic deenitions and results of the theory of quantales (a good reference is Ros]). Quantales were introduced by Mulvey ((Mul]) as an algebraic tool for studying representations of non-commutative C-algebras. Informally, a quantale is a complete lattice Q equipped with a product distributive over arbitrary sup's. The importance of quantales for Linear Logic is revealed in Yetter's work ((Yet]), who proved that semantics of classical linear logic is given by a class of quantales, named Girard quantales, which coincides with Girard's phase semantics. An analogous result is obtained for a sort of non-commutative linear logic, as well as intuitionistic linear logic without negation, which suggest that the utilisation of the theory of quantales (or even weaker structures, such that *-autonomous posets) might be fruitful in studying the semantic of several variants of linear logic. As usual, we denote the order in a lattice by , while W and V denote the operations of sup and inf, respectively. We write > for the largest element in a lattice and 0 for its smallest element. Deenition 1.1 A quantale is a complete lattice Q with an associative binary operation : Q Q?! Q , which distributes on the right and on the left of arbitrary sup's, i.e.: Q1] a (b c) = (a b) c, for every a; b; c 2 Q Q2] a (W i2I a i) = W i2I (a a i), (W i2I a i) a = W i2I (a i a) A quantale Q is unital if it has an element 1 2 Q such that a1 = 1a = a, for every a 2 Q. A quantale Q is commutative if a b = b a, for every a, b 2 Q. A morphism of quantales is an operator between quantales which preserves and arbitrary sup's. It's easily seen that the above axioms imply that is increasing in both coordinates, that is If a b then, 8 c 2 Q, a c b c and c a c b We register a classic result:
منابع مشابه
Equality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملEquality of proofs for linear equality
This paper is about equality of proofs in which a binary predicate formalizing properties of equality occurs, besides conjunction and the constant true proposition. The properties of equality in question are those of a preordering relation, those of an equivalence relation, and other properties appropriate for an equality relation in linear logic. The guiding idea is that equality of proofs is ...
متن کاملLogic of predicates versus linear logic
The purpose of this note is to suggest an alternative explanation of the relationship between predicate logics with equality and linear logic. The explanation given by Girard resorts to so called exponentials, which are believed to extract from a linear formula A its classical content !A and ?A. Thus, Girard gives a top-down explanation of the relationship between linear and classical logics: t...
متن کاملLock, Linear Lambda-Paramodulation in Operator Fuzzy Logic
The author proposed concepts of Operator Fuzzy Logic and-Resolution in 1984. He and his cooperaters have obtained some theoretical results. This paper introduces-paramodulation to handle a set of clauses with the predicate of equality, and thus the equality substitution can be used in fuzzy reasoning. Then the-paramodulation method is proved to be complete with lock-semantic method. Finally, Ya...
متن کاملLogic of Predicates with Explicit Substitutions
We present a non-commutative linear logic | the logic of predicates with equality and explicit substitutions. Thus, the position of linear logic with respect to the usual logic is given a new explanation. 1 The world according to Girard A recent introduction to linear logic, cf. 13], starts with the following explanation of the position of usual logic with respect to the linear. Linear logic is...
متن کاملEfficient Interval Linear Equality Solving in Constraint Logic Programming
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constraints over real numbers, which constitute an important class of problems in engineering and other applications. In this paper, we suggest to separate linear equality constraint solving from inequality and non-linear con...
متن کامل